The Extended Literal Encoding of SAT into CSP
نویسندگان
چکیده
We introduce the “extended literal” encoding of SAT into CSP. This is the first encoding which is “propagation-optimal”. That is, propagation using the standard search algorithm MAC in the CSP encoding performs the same search as Davis Putnam on the original SAT instance, and does so in the same worst case time complexity. We provide theoretical analysis of the encoding and a sample implementation
منابع مشابه
An Empirical Measure for Characterizing 3-SAT
The literal encoding of the satisfiability problem (SAT) as a binary constraint satisfaction problem (CSP) allows us to make a technical comparison between the propositional logic and the constraint network fields. Equivalencies or analogies between concepts and techniques used in the two fields are then shown. For instance it is shown that arc consistency is equivalent to unit resolution [7, 2...
متن کاملA Compact and Efficient SAT-Encoding of Finite Domain CSP
Extended Abstract A (finite) Constraint Satisfaction Problem (CSP) is a combinatorial problem to find an assignment which satisfies all given constraints over finite domains. A SAT-based CSP solver is a program which solves a CSP by encoding it to SAT and searching solutions by SAT solvers. Remarkable improvements in the efficiency of SAT solvers make SAT-based CSP solvers applicable for solvin...
متن کاملComputing Science Group THE ORDER ENCODING: FROM TRACTABLE CSP TO TRACTABLE SAT
Many mathematical and practical problems can be expressed as constraint satisfaction problems (CSPs). One way to solve a CSP instance is to encode it into SAT and use a SAT-solver. However, important information about the problem can get lost during the translation stage. For example, although the general constraint satisfaction problem is known to be NP-complete, there are some classes of CSP ...
متن کاملModelling Max-CSP as Partial Max-SAT
We define a number of original encodings that map MaxCSP instances into partial Max-SAT instances. Our encodings rely on the well-known direct and support encodings from CSP into SAT. Then, we report on an experimental investigation that was conducted to compare the performance profile of our encodings on random binary Max-CSP instances. Moreover, we define a new variant of the support encoding...
متن کاملSolving Planning-Graph by Compiling It into CSP
Although the deep affinity between Graphplan’s backward search, and the process of solving constraint satisfaction problems has been noted earlier, these relations have hither-to been primarily used to adapt CSP search techniques into the backward search phase of Graphplan. This paper describes GP-CSP, a system that does planning by automatically converting Graphplan’s planning graph into a CSP...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003